#include <cstdio>
#include <string>
#include <iostream>
#include <cmath>

using namespace std;

int v, m;
double dian[1012][2];
double dis;
int n;
int map[1012][1012];
int queue[2][100002];
int sign[1012];
int step;
bool havefind;
void wfs()
{
	int one=0, two=1, i, j, k, x;
	
	step = 0;
	memset(sign,0, sizeof(sign));
	havefind = false;
	
	queue[one][0] = 1;
	queue[one][1] = 1;
	queue[two][0] = 0;
	
	while (queue[one][0])
	{
		for (k=1; k<=queue[one][0]; ++k)
		{
			x = queue[one][k];
			if (sign[x] == 0)
			for (i=1, sign[x]=1; i<=map[x][0]; ++i)
			{
				j = map[x][i];
				if (sign[j] == 0)
				{
					if (j==2) 
					{
						havefind = true;
						return;
					}
					else
					{	
						queue[two][++queue[two][0]] = j;
					}
				}
			}					
		}
		
		one = one ^ 1;
		two = two ^ 1;
		queue[two][0] = 0;
		step ++;
	}
	
}

int main()
{
	double a, b;
	int i, j, k;
	
//	freopen("din.txt", "r", stdin);
//	freopen("dout.txt", "w", stdout);
	
	scanf("%d%d", &v, &m);
	dis = v*m*60;
	dis *= dis;
	n = 0;
	while (cin >> a >> b)
	{
		n++;
		dian[n][0] = a;
		dian[n][1] = b;
	}
	
	memset(map, 0, sizeof(map));
	for (i=1; i<n; ++i)
		for (j=i+1; j<=n; ++j)
		{
			a = (dian[i][0]-dian[j][0])*(dian[i][0]-dian[j][0])
				+(dian[i][1]-dian[j][1])*(dian[i][1]-dian[j][1]);
			if (a < dis || fabs(a-dis) < 1e-6)
			{
				map[i][ ++map[i][0]] = j;	
				map[j][ ++map[j][0]] = i;
			}
		}
/*	
	for (i=1; i<=n; ++i)
	{
		printf("%d: ", i);
		for (j=1; j<=map[i][0]; ++j)
 			printf("%d ", map[i][j]);
		printf("\n");
	}
*/		

		
	wfs();
	if (havefind) printf("Yes, visiting %d other holes.\n", step);
	else printf("No.\n"); 
	
	return 0;	
}



